std::map::lower_bound

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++0x feature) Atomic operations library (C++0x feature) Thread support library (C++0x feature)
Containers library
array (C++0x feature) vector deque forward_list (C++0x feature) list set multiset map multimap unordered_set (C++0x feature) unordered_multiset (C++0x feature) unordered_map (C++0x feature) unordered_multimap (C++0x feature) stack queue priority_queue
std::map
Member functions map::map map::~map map::operator= map::get_allocator Element access map::at map::operator[] Iterators map::begin map::cbegin (C++0x) map::end map::cend (C++0x) map::rbegin map::crbegin (C++0x) map::rend map::crend (C++0x) Capacity map::empty map::size map::max_size Modifiers map::clear map::insert map::emplace map::emplace_hint (C++0x) map::erase map::swap Lookup map::count map::find map::equal_range map::lower_bound map::upper_bound Observers map::key_comp map::value_comp

​iterator lower_bound( const Key& key );​
​const_iterator lower_bound( const Key& key ) const;​

Returns an iterator pointing to the first element that is not less than key.

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

Parameters

key

-

key value to compare the elements to

Return value

iterator pointing to the first element that is not less than key. If no such element is found, past-the-end (see end()) iterator is returned.

Complexity

This section is incomplete

See also

equal_range	returns range of elements matching a specific key (public member function)
upper_bound	returns an iterator to the first element greater than a certain value (public member function)